Improved approximation of layout problems on random graphs
نویسندگان
چکیده
Inspired by previous work of Diaz, Petit, Serna, and Trevisan (Approximating layout problems on random graphs Discrete Mathematics, 235, 2001, 245–253), we show that several well-known graph layout problems are approximable to within a factor arbitrarily close to 1 of the optimal with high probability for random graphs drawn from an ErdösRenyi distribution with appropriate sparsity conditions. Moreover, we show that the same results hold for the analogous problems on directed acyclic graphs.
منابع مشابه
Algorithms for string and graph layout
Many graph optimization problems can be viewed as graph layout problems. A layout of a graph is a geometric arrangement of the vertices subject to given constraints. For example, the vertices of a graph can be arranged on a line or a circle, on a twoor three-dimensional lattice, etc. The goal is usually to place all the vertices so as to optimize some specified objective function. We develop co...
متن کاملApproximating layout problems on random graphs
We show that, with overwhelming probability, several well known layout problems are approximable within a constant for random graphs drawn from the G(n, pn) model where C/n ≤ pn ≤ 1 for all n big enough and for some properly characterized parameter C > 1. In fact, our results establish that, with overwhelming probability, the cost of any arbitrary layout of such a random graph is within a const...
متن کاملApproximating Layout Problems on Random Geometric Graphs
In this paper, we study the approximability of several layout problems on a family of random geometric graphs. Vertices of random geometric graphs are randomly distributed on the unit square and are connected by edges whenever they are closer than some given parameter. The layout problems that we consider are: Bandwidth, Minimum Linear Arrangement, Minimum Cut Width, Minimum Sum Cut, Vertex Sep...
متن کاملInapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
Graphical models, such as Bayesian Networks and Markov networks play an important role in artificial intelligence and machine learning. Inference is a central problem to be solved on these networks. This, and other problems on these graph models are often known to be hard to solve in general, but tractable on graphs with bounded Treewidth. Therefore, finding or approximating the Treewidth of a ...
متن کاملLinear Orderings of Random Geometric Graphs
In random geometric graphs, vertices are randomly distributed on [0, 1] and pairs of vertices are connected by edges whenever they are sufficiently close together. Layout problems seek a linear ordering of the vertices of a graph such that a certain measure is minimized. In this paper, we study several layout problems on random geometric graphs: Bandwidth, Minimum Linear Arrangement, Minimum Cu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1710.10339 شماره
صفحات -
تاریخ انتشار 2017